Molecular evidence for ongoing complementarity and horizontal gene transfer in endosymbiotic systems of mealybugs

نویسندگان

  • Sergio López-Madrigal
  • Aleixandre Beltrà
  • Serena Resurrección
  • Antonia Soto
  • Amparo Latorre
  • Andrés Moya
  • Rosario Gil
چکیده

Intracellular bacterial supply of essential amino acids is common among sap-feeding insects, thus complementing the scarcity of nitrogenous compounds in plant phloem. This is also the role of the two mealybug endosymbiotic systems whose genomes have been sequenced. In the nested endosymbiotic system from Planococcus citri (Pseudococcinae), "Candidatus Tremblaya princeps" and "Candidatus Moranella endobia" cooperate to synthesize essential amino acids, while in Phenacoccus avenae (Phenacoccinae) this function is performed by its single endosymbiont "Candidatus Tremblaya phenacola." However, little is known regarding the evolution of essential amino acid supplementation strategies in other mealybug systems. To address this knowledge gap, we screened for the presence of six selected loci involved in essential amino acid biosynthesis in five additional mealybug species. We found evidence of ongoing complementarity among endosymbionts from insects of subfamily Pseudococcinae, as well as horizontal gene transfer affecting endosymbionts from insects of family Phenacoccinae, providing a more comprehensive picture of the evolutionary history of these endosymbiotic systems. Additionally, we report two diagnostic motifs to help identify invasive mealybug species.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An ancient horizontal gene transfer between mosquito and the endosymbiotic bacterium Wolbachia pipientis.

The extent and biological relevance of horizontal gene transfer (HGT) in eukaryotic evolution remain highly controversial. Recent studies have demonstrated frequent and large-scale HGT from endosymbiotic bacteria to their hosts, but the great majority of these transferred genes rapidly become nonfunctional in the recipient genome. Here, we investigate an ancient HGT between a host metazoan and ...

متن کامل

Infection dynamics of coexisting beta- and gammaproteobacteria in the nested endosymbiotic system of mealybugs.

We investigated the infection dynamics of endosymbiotic bacteria in the developmental course of the mealybugs Planococcus kraunhiae and Pseudococcus comstocki. Molecular phylogenetic analyses identified a betaproteobacterium and a gammaproteobacterium from each of the mealybug species. The former bacterium was related to the beta-endosymbionts of other mealybugs, i.e., "Candidatus Tremblaya pri...

متن کامل

A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

متن کامل

Endosymbiotic and horizontal gene transfer in microbial eukaryotes

The evolution of microbial eukaryotes, in particular of photosynthetic lineages, is complicated by multiple instances of endosymbiotic and horizontal gene transfer (E/HGT) resulting from plastid origin(s). Our recent analysis of diatom membrane transporters provides evidence of red and/or green algal origins of 172 of the genes encoding these proteins (ca. 25% of the examined phylogenies), with...

متن کامل

A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2014